New Approaches to Data Location
نویسندگان
چکیده
The advent of grassroots content distribution systems (e.g., Gnutella, FreeNet, Napster, Oceanstore) indicates the need for a distributed data location algorithm [HBMKK00, Cla00, Fan00, K+00a]. In this paper we investigate three methods of data location: distance-vector routing and link-state vector routing using Bloom filters, and a naive cache sharing algorithm. These data location methods are also applicable to traditional services, such as DNS, whose root server traffic has doubled in the last few months [Wal00].
منابع مشابه
A Robust Scenario Based Approach in an Uncertain Condition Applied to Location-Allocation Distribution Centers Problem
The paper discusses the location-allocation model for logistic networks and distribution centers through considering uncertain parameters. In real-world cases, demands and transshipment costs change over the period of the time. This may lead to large cost deviation in total cost. Scenario based robust optimization approaches are proposed where occurrence probability of each scenario is not know...
متن کاملGeneral form of a cooperative gradual maximal covering location problem
Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...
متن کاملA Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem
In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...
متن کاملEstimating scour below inverted siphon structures using stochastic and soft computing approaches
This paper uses nonlinear regression, Artificial Neural Network (ANN) and Genetic Programming (GP) approaches for predicting an important tangible issue i.e. scours dimensions downstream of inverted siphon structures. Dimensional analysis and nonlinear regression-based equations was proposed for estimation of maximum scour depth, location of the scour hole, location and height of the dune downs...
متن کاملA New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
متن کاملA New Fast and Accurate Fault Location and Classification Method on MTDC Microgrids Using Current Injection Technique, Traveling-Waves, Online Wavelet, and Mathematical Morphology
In this paper, a new fast and accurate method for fault detection, location, and classification on multi-terminal DC (MTDC) distribution networks connected to renewable energy and energy storages presented. MTDC networks develop due to some issues such as DC resources and loads expanding, and try to the power quality increasing. It is important to recognize the fault type and location in order ...
متن کامل